Model checking C++ programs

In the last three decades, memory safety issues in system programming languages such as C or C++ have been one of most significant sources security vulnerabilities. However, there exist only a few attempts with limited success to cope complexity program verification. We describe and evaluate novel verification approach based on bounded model checking (BMC) satisfiability modulo theories (SMT) verify programs. Our analyses programs by encoding into SMT various sophisticated features that language offers, templates, inheritance, polymorphism, exception handling, Standard Template Libraries. formalize these within our formal framework using decidable fragment first-order logic then show how state-of-the-art solvers can efficiently handle that. implemented top ESBMC. compare ESBMC LLBMC DIVINE, which are verifiers check directly from LLVM bitcode. Experimental results wide range programs, presenting higher number correct results. Additionally, has applied commercial application telecommunication domain successfully detected arithmetic-overflow errors, could potentially lead